Toward user patterns for online security Observation time and online user identification.

Constructing Ensembles from Data Envelopment Analysis.

Cluster Evolution and Interpretation via Penalties.

On Characterization and Discovery of Minimal Unexpected Patterns in Rule Discovery.

Selectively Acquiring Customer Information A New Data Acquisition Problem and an Active Learning%2DBased Solution.%2
Robots are now employed to carry out well-defined tasks in customized static environments, often at a high speed and an astonishing level of precision. However, these robots usually depend totally in their actions on a detailed control scheme developed in advance during an off-line planning phase. Due to recent progress in electronics and computing power, in control and agent technology, and in computer vision and machine learning, the development of autonomous robots capable of solving high-level deliberate tasks in natural environments can now be approached seriously. This article provides essential vision- and learning-related aspects for developing autonomous camera-equipped robot systems. 1
Selectively Acquiring Customer Information A New Data Acquisition Problem and an Active Learning%2DBased Solution.%2
Robots are now employed to carry out well-defined tasks in customized static environments, often at a high speed and an astonishing level of precision. However, these robots usually depend totally in their actions on a detailed control scheme developed in advance during an off-line planning phase. Due to recent progress in electronics and computing power, in control and agent technology, and in computer vision and machine learning, the development of autonomous robots capable of solving high-level deliberate tasks in natural environments can now be approached seriously. This article provides essential vision- and learning-related aspects for developing autonomous camera-equipped robot systems. 1
GHIC A Hierarchical Pattern%2DBased Clustering Algorithm for Grouping Web Transactions.

On the discovery of significant statistical quantitative rules.


A DEA approach for model combination.
This paper proposes a novel Data Envelopment Analysis (DEA) based approach for model combination. We first prove that for the 2-class classification problems DEA models identify the same convex hull as the popular ROC analysis used for model combination. For general k-class classifiers, we then develop a DEA-based method to combine multiple classifiers. Experiments show that the method outperforms other benchmark methods and suggest that DEA can be a promising tool for model combination.

On Original Generation of Structure in Legal Documents.
This position paper advocates a vision in the development of automated legal reasoning and presents evidence supporting the plausibility of that vision. The paper observes that original creation of documents of legal import in either fully formal or semistructured form o#ers the prospect of greatly reducing the cost and expanding the scope of knowledge engineering for legal reasoning. This, it is claimed, is most likely to be achieved via formalization of various sublanguages of legal discourse. SeaSpeak is an example of such a sublanguage and it appears to be amenable to full formalization. Short of that, much can be done with partial formalization and semistructured documents. The paper presents a tabular format for message expression, motivated by a formal agent communication language.
Segmenting Customer Transactions Using a Pattern%2DBased Clustering Approach.

On the Existence and Significance of Data Preprocessing Biases in Web%2DUsage Mining.
The literature on web-usage mining is replete with data preprocessing techniques, which correspond to many closely related problem formulations. We survey datapreprocessing techniques for session-level pattern discovery and compare three of these techniques in the context of understanding session-level purchase behavior on the web. Using real data collected from 20,000 users ’ browsing behavior over a period of six months, four different models (linear regressions, logistic regressions, neural networks, and classification trees) are built based on data preprocessed using three different techniques. The results demonstrate that the three approaches result in radically different conclusions and provide initial evidence that a data preprocessing bias exists, the effect of which can be significant.

On the Use of Optimization for Data Mining Theoretical Interactions and eCRM Opportunities.




Personalization from incomplete data what you don%27t know can hurt.
Clickstream data collected at any web site (site-centric data) is inherently incomplete, since it does not capture users&#039; browsing behavior across sites (user-centric data). Hence, models learned from such data may be subject to limitations, the nature of which has not been well studied. Understanding the limitations is particularly important since most current personalization techniques are based on site-centric data only. In this paper, we empirically examine the implications of learning from incomplete data in the context of two specific problems: (a) predicting if the remainder of any given session will result in a purchase and (b) predicting if a given user will make a purchase at any future session. For each of these problems we present new algorithms for fast and accurate data preprocessing of clickstream data. Based on a comprehensive experiment on user-level clickstream data gathered from 20,000 users&#039; browsing behavior, we demonstrate that models built on user-centric data outperform models built on site-centric data for both prediction tasks.
Small is beautiful discovering the minimal set of unexpected patterns.
A drawback of most traditional data mining methods is that they do not leverage prior knowledge of users. In many business settings, managers and analysts have significant intuition based on several years of experience. In prior work [11, 12] we proposed methods that could discover unexpected patterns in data by using this domain knowledge in a systematic manner. In this paper we continue our focus on discovering unexpected patterns and propose new methods for discovering a minimal set of unexpected patterns that discover orders of magnitude fewer patterns and yet retain most of the truly interesting ones. We demonstrate the strengths of this approach experimentally using a case study application in a marketing domain.  1. INTRODUCTION  A well-known criticism of many rule discovery algorithms in data mining is that they generate too many patterns, many of which are obvious or irrelevant. It stands to reason that more effective  methods are needed to discover fewer and more relevant pat...
A Belief%2DDriven Method for Discovering Unexpected Patterns.
Several pattern discovery methods proposed in the data  mining literature have the drawbacks that they discover  too many obvious or irrelevant patterns and that they do  not leverage to a full extent valuable prior domain  knowledge that decision makers have. In this paper we  propose a new method of discovery that addresses these  drawbacks. In particular we propose a new method of  discovering unexpected patterns that takes into  consideration prior background knowledge of decision  makers. This prior knowledge constitutes a set of  expectations or beliefs about the problem domain. Our  proposed method of discovering unexpected patterns uses  these beliefs to seed the search for patterns in data that  contradict the beliefs. To evaluate the practicality of our  approach, we applied our algorithm to consumer purchase  data from a major market research company and to web  logfile data tracked at an academic Web site and present  our findings in the paper.  
Pattern Discovery in Temporal Databases A Temporal Logic Approach.
The work of Mannila et al. [4] of finding frequent  episodes in sequences is extended to finding temporal  logic patterns in temporal databases. It is argued that  temporal logic provides an appropriate formalism for  expressing temporal patterns defined over categorical  data. It is also proposed to use Temporal Logic  Programming as a mechanism for the discovery of  frequent patterns expressible in temporal logic. It is  explained in the paper how frequent temporal patterns  can be discovered by constructing temporal logic  programs. To test these methods , temporal logic  programs were constructed for certain classes of patterns  and were implemented in OPS5.  Introduction  In this paper, we address the problem of finding interesting patterns in temporal databases [1,2] defined over categorical (symbolic) data. This is an important problem that frequently occurs in various applications such as molecular biology (finding patterns in genetic sequences), telecommunications (finding pat...
